conventional Fourier kernel
- conventional Fourier kernel
Англо-русский словарь промышленной и научной лексики.
2014.
Смотреть что такое "conventional Fourier kernel" в других словарях:
Discrete-time Fourier transform — In mathematics, the discrete time Fourier transform (DTFT) is one of the specific forms of Fourier analysis. As such, it transforms one function into another, which is called the frequency domain representation, or simply the DTFT , of the… … Wikipedia
Dirac delta function — Schematic representation of the Dirac delta function by a line surmounted by an arrow. The height of the arrow is usually used to specify the value of any multiplicative constant, which will give the area under the function. The other convention… … Wikipedia
Distribution (mathematics) — This article is about generalized functions in mathematical analysis. For the probability meaning, see Probability distribution. For other uses, see Distribution (disambiguation). In mathematical analysis, distributions (or generalized functions) … Wikipedia
Cell (microprocessor) — Cell is a microprocessor architecture jointly developed by Sony Computer Entertainment, Toshiba, and IBM, an alliance known as STI . The architectural design and first implementation were carried out at the STI Design Center in Austin, Texas over … Wikipedia
Sobolev space — In mathematics, a Sobolev space is a vector space of functions equipped with a norm that is a combination of Lp norms of the function itself as well as its derivatives up to a given order. The derivatives are understood in a suitable weak sense… … Wikipedia
Chebyshev polynomials — Not to be confused with discrete Chebyshev polynomials. In mathematics the Chebyshev polynomials, named after Pafnuty Chebyshev,[1] are a sequence of orthogonal polynomials which are related to de Moivre s formula and which can be defined… … Wikipedia
Rader's FFT algorithm — Rader s algorithm (1968) is a fast Fourier transform (FFT) algorithm that computes the discrete Fourier transform (DFT) of prime sizes by re expressing the DFT as a cyclic convolution. (The other algorithm for FFTs of prime sizes, Bluestein s… … Wikipedia
GPGPU — General purpose computing on graphics processing units (GPGPU, also referred to as GPGP and to a lesser extent GP²) is the technique of using a GPU, which typically handles computation only for computer graphics, to perform computation in… … Wikipedia
Legendre transformation — f(x) . The function is shown in red, and the tangent line at point (x 0, f(x 0)) is shown in blue. The tangent line intersects the vertical axis at (0, f^star) and f^star is the value of the Legendre transform f^star(p 0) , where p 0=dot{f}(x 0) … Wikipedia
Mathematical formulation of quantum mechanics — Quantum mechanics Uncertainty principle … Wikipedia
Dimensional analysis — In physics and all science, dimensional analysis is a tool to find or check relations among physical quantities by using their dimensions. The dimension of a physical quantity is the combination of the basic physical dimensions (usually mass,… … Wikipedia